منابع مشابه
Exploration of Faulty Hamiltonian Graphs
We consider the problem of exploration of networks, some of whose edges are faulty. A mobile agent, situated at a starting node and unaware of which edges are faulty, has to explore the connected fault-free component of this node by visiting all of its nodes. The cost of the exploration is the number of edge traversals. For a given network and given starting node, the overhead of an exploration...
متن کاملThe Embedding of Hamiltonian Paths in Faulty Arrangement Graphs
The arrangement graph, which represents a family of scalable graphs, is a generalization of the star graph. There are two parameters, denoted by n and k, for the arrangement graph, where 1 1 ≤ ≤ − k n . An n k , -arrangement graph, which is denoted by An,k, has vertices corresponding to the arrangements of k numbers out of the set 1 2 , , , n . In this thesis, a fault-free Hamiltonian path is e...
متن کاملFault-Free Hamiltonian Cycles in Faulty Butterfly Graphs
The butterfly graphs were originally defined as the underlying graphs of FFT networks which can perform the fast Fourier transform (FFT) very eficiently. Since butterfly graphs are regular of degree four, it can tolerate at most two edge faults in the worst case in order to establish a Hamiltonian cycle. In this paper, we show that butterfly graphs contain a fault-free Hamiltonian cycle even if...
متن کاملHamiltonian Paths and Cycles in Faulty Burnt Pancake Graphs
Recently, research on parallel processing systems is very active, and many complex topologies have been proposed. A burnt pancake graph is one such topology. In this paper, we prove that a faulty burnt pancake graph with degree n has a fault-free Hamiltonian cycle if the number of faulty elements is no more than n − 2, and it has a fault-free Hamiltonian path between any pair of non-faulty node...
متن کاملFault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
The arrangement graph An,k, which is a generalization of the star graph (n − k = 1), presents more flexibility than the star graph in adjusting the major design parameters: number of nodes, degree, and diameter. Previously, the arrangement graph has proved Hamiltonian. In this paper, we further show that the arrangement graph remains Hamiltonian even if it is faulty. Let Fe and Fv denote ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2016
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054116500313